Parallel Solvers for Large Eigenvalue Problems Originating from Maxwell's Equations
نویسندگان
چکیده
We present experiments with two new solvers for large sparse symmetric matrix eigenvalue problems: (1) the implicitly restarted Lanc-zos algorithm and (2) the Jacobi-Davidson algorithm. The eigenvalue problems originate from in the computation of a few of the lowest frequencies of standing electromagnetic waves in cavities that have been discretized by the nite element method. The experiments have been conducted on up to 12 processors of an HP Exemplar X-Class multipro-cessor computer.
منابع مشابه
A Comparison of Solvers for Large Eigenvalue Problems Originating from Maxwell's Equations
We present experiments with various solvers for large sparse matrix eigenvalue problems. These problems occur in the computation of a few of the lowest frequencies of standing electromagnetic waves in cavities that have been discretized by the nite element method. The solvers investigated are (1) subspace iteration, (2) block Lanczos algorithm, (3) implicitly restarted Lanczos algorithm and (4)...
متن کاملAccelerated solution of the frequency-domain Maxwell's equations by engineering the eigenvalue distribution of the operator.
We introduce a simple method to accelerate the convergence of iterative solvers of the frequency-domain Maxwell's equations for deep-subwavelength structures. Using the continuity equation, the method eliminates the high multiplicity of near-zero eigenvalues of the operator while leaving the operator nearly positive-definite. The impact of the modified eigenvalue distribution on the accelerated...
متن کاملA Brief Introduction to Krylov Space Methods for Solving Linear Systems
With respect to the " influence on the development and practice of science and engineering in the 20th century " , Krylov space methods are considered as one of the ten most important classes of numerical methods [1]. Large sparse linear systems of equations or large sparse matrix eigenvalue problems appear in most applications of scientific computing. Sparsity means that most elements of the m...
متن کاملA parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc’s efficient and various parallel operations, linear so...
متن کاملON MAXWELL'S STRESS FUNCTIONS FOR SOLVING THREE DIMENSIONAL ELASTICITY PROBLEMS IN THE THEORY OF ELASTICITY
The governing equations of three dimensional elasticity problems include the six Beltrami-Michell stress compatibility equations, the three differential equations of equilibrium, and the six material constitutive relations; and these are usually solved subject to the boundary conditions. The system of fifteen differential equations is usually difficult to solve, and simplified methods are usual...
متن کامل